On two conjectures of Maurer concerning basis graphs of matroids
نویسندگان
چکیده
We characterize 2–dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer (Conjecture 3 of S. Maurer, Matroid basis graphs I, JCTB 14 (1973), 216–240). We also establish Conjecture 1 from the same paper about the redundancy of the conditions in the characterization of basis graphs. We indicate positive-curvature-like aspects of the local properties of the studied complexes. We characterize similarly the corresponding 2–dimensional complexes of even ∆–matroids.
منابع مشابه
Proof of two Maurer's conjectures on basis graphs of matroids
We characterize 2–dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer (Conjecture 3 of S. Maurer, Matroid basis graphs I, JCTB 14 (1973), 216–240). We also establish Conjecture 1 from the same paper about the redundancy of the...
متن کاملZeros of Chromatic and Flow Polynomials of Graphs
We survey results and conjectures concerning the zero distribution of chromatic and flow polynomials of graphs, and characteristic polynomials of matroids.
متن کاملBasis graphs of even Delta-matroids
A -matroid is a collection B of subsets of a finite set I, called bases, not necessarily equicardinal, satisfying the symmetric exchange property: For A,B ∈ B and i ∈ A B, there exists j ∈ B A such that (A {i, j}) ∈ B. A -matroid whose bases all have the same cardinality modulo 2 is called an even -matroid. The basis graph G=G(B) of an even -matroid B is the graph whose vertices are the bases o...
متن کاملNegative Correlation in Graphs and Matroids
The following two conjectures arose in the work of Grimmett and Winkler, and Pemantle: the uniformly random forest F and the uniformly random connected subgraph C of a finite graph G have the edge-negative-association property. In other words, for all distinct edges e and f of G, the probability that F (respectively, C) contains e conditioned on containing f is less than or equal to the probabi...
متن کاملStructural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 114 شماره
صفحات -
تاریخ انتشار 2015